THE MAXIMUM CONNECTIVITY OF A GRAPH

Toughness of the Networks with Maximum Connectivity

The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...

The Maximum Number of Edges in a Strongly Multiplicative Graph

A note on "Tenacity of a graph with maximum connectivity"

In this note, we show that one of the arguments used by Moazzami for computing the tenacity of the third Harary graph is wrong and then improve the proof. © 2014 Published by Elsevier B.V.

toughness of the networks with maximum connectivity

the stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. as the network begins losing links or nodes, eventually there is a loss in its effectiveness. thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...

On the Maximum Number of Dominating Classes in Graph Coloring

In this paper we investigate the dominating- -color number،  of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].